Durative Graph Transformation Rules
نویسندگان
چکیده
منابع مشابه
A Flexible Constraint Model for Validating Plans with Durative Actions
Planning problems with durative actions represent one of the hot research topics in the area of AI planning. Because durative actions introduce numerical aspects to planning, constraint satisfaction technology is becoming more popular in solving this new type of planning problems. The paper describes a constraint programming approach for validating and finishing partially ordered plans with dur...
متن کاملPattern composition in graph transformation rules
Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and...
متن کاملOn Managing Temporal Information for Handling Durative Actions in LPG
This paper presents how LPG manages ordering constraints for full handling of durative actions introduced by the recent standard language PDDL2.1. LPG is a domain-independent planner that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The current version of our planner is based on a graph-based representation called “Temporal Durative A...
متن کاملGraph transformation and pointer structures
This thesis is concerned with the use of graph-transformation rules to specify and manipulate pointer structures. In it, we show that graph transformation can form the basis of a practical and well-formalised approach to specifying pointer properties. We also show that graph transformation rules can be used as an efficient mechanism for checking the properties of graphs. We make context-sensiti...
متن کاملSpatial and Temporal Refinement of Typed Graph Transformation Systems
Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013